On a Parallel Extended Euclidean Algorithm
نویسنده
چکیده
A new parallelization of Euclid’s greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel Oε(n/log n) time using only n processors on a Priority CRCW PRAM.
منابع مشابه
Highly scalable on-the-fly interleaved address generation for UMTS/HSPA+ parallel turbo decoder
High throughput parallel interleaver design is a major challenge in designing parallel turbo decoders that conform to high data rate requirements of advanced standards such as HSPA+. The hardware complexity of the HSPA+ interleaver makes it difficult to scale to high degrees of parallelism. We propose a novel algorithm and architecture for on-the-fly parallel interleaved address generation in U...
متن کاملParallel Transport Frame in 4 -dimensional Euclidean Space
In this work, we give parallel transport frame of a curve and we introduce the relations between the frame and Frenet frame of the curve in 4-dimensional Euclidean space. The relation which is well known in Euclidean 3-space is generalized for the rst time in 4-dimensional Euclidean space. Then we obtain the condition for spherical curves using the parallel transport frame of them. The conditi...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملHigh-speed C-testable systolic array design for Galois-field inversion
Systolic architectures for inversion in Galois eld (GF (2)) are presented. The proposed inversion algorithm is a counter-free extended Euclidean algorithm, which results in simple circuit implementation for GF inversion. Additionally, the bit-parallel implementation proposed is shown to be C-testable. Testability and modularity make it suited to VLSI implementation.
متن کاملFast Hardware Algorithm for Division in hbox 2m Based on the Extended Euclid's Algorithm With Parallelization of Modular Reductions
We propose a fast hardware algorithm for division in GF(2) based on the extended Euclid’s algorithm. The algorithm requires only one iteration to perform the operations that correspond to the ones performed in two iterations of previously reported division algorithms. Since the algorithm performs modular reductions in parallel by changing the order of execution of the operations, a circuit base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001